Flow modules and nowhere-zero flows
نویسندگان
چکیده
Let $$\varGamma $$ be a graph, A an abelian group, $${\mathcal {D}}$$ given orientation of and R unital subring the endomorphism ring A. It is shown that set all mappings $$\varphi from $$E(\varGamma )$$ to such $$({\mathcal {D}},\varphi A-flow forms left R-module. union two subgraphs _{1}$$ _{2}$$ , $$p^n$$ prime power. proved admits nowhere-zero -flow if have at most $$p^n-2$$ common edges both admit -flows. Moreover, it 4-flow 4-flows their induce subgraph size 2 or connected 3. This result can seen as generalization theorem Catlin graph cycle length 4 admitting 4-flow.
منابع مشابه
Nowhere-zero 5-flows
We prove that every cyclically 6-edge-connected cubic graph with oddness at most 4 has a nowhere-zero 5-flow. Therefore, a possible minimum counterexample to the 5-flow conjecture has oddness at least 6.
متن کاملNowhere-zero flow polynomials
In this article we introduce the flow polynomial of a digraph and use it to study nowherezero flows from a commutative algebraic perspective. Using Hilbert’s Nullstellensatz, we establish a relation between nowhere-zero flows and dual flows. For planar graphs this gives a relation between nowhere-zero flows and flows of their planar duals. It also yields an appealing proof that every bridgeless...
متن کاملNowhere-zero flows on signed regular graphs
We study the flow spectrum S(G) and the integer flow spectrum S(G) of odd regular graphs. We show that there are signed graphs where the difference between the integer flow number and the flow number is greater than or equal to 1, disproving a conjecture of Raspaud and Zhu [7]. Let G be a (2t + 1)-regular graph. We show that if r ∈ S(G), then r = 2 + 1t or r ≥ 2 + 2 2t−1 . This result generaliz...
متن کاملNowhere zero flows in line graphs
Cai an Corneil (Discrete Math. 102 (1992) 103–106), proved that if a graph has a cycle double cover, then its line graph also has a cycle double cover, and that the validity of the cycle double cover conjecture on line graphs would imply the truth of the conjecture in general. In this note we investigate the conditions under which a graph G has a nowhere zero kow would imply that L(G), the line...
متن کاملNowhere-Zero Flows in Random Graphs
A nowhere-zero 3-flow in a graph G is an assignment of a direction and a value of 1 or 2 to each edge of G such that, for each vertex v in G, the sum of the values of the edges with tail v equals the sum of the values of the edges with head v. Motivated by results about the region coloring of planar graphs, Tutte conjectured in 1966 that every 4-edge-connected graph has a nowhere-zero 3-flow. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2022
ISSN: ['0925-9899', '1572-9192']
DOI: https://doi.org/10.1007/s10801-022-01177-4